Pull or Push? Octopuses Solve a Puzzle Problem

نویسندگان

  • Jonas N. Richter
  • Binyamin Hochner
  • Michael J. Kuba
چکیده

Octopuses have large brains and exhibit complex behaviors, but relatively little is known about their cognitive abilities. Here we present data from a five-level learning and problem-solving experiment. Seven octopuses (Octopus vulgaris) were first trained to open an L shaped container to retrieve food (level 0). After learning the initial task all animals followed the same experimental protocol, first they had to retrieve this L shaped container, presented at the same orientation, through a tight fitting hole in a clear Perspex partition (level 1). This required the octopuses to perform both pull and release or push actions. After reaching criterion the animals advanced to the next stage of the test, which would be a different consistent orientation of the object (level 2) at the start of the trial, an opaque barrier (level 3) or a random orientation of the object (level 4). All octopuses were successful in reaching criterion in all levels of the task. At the onset of each new level the performance of the animals dropped, shown as an increase in working times. However, they adapted quickly so that overall working times were not significantly different between levels. Our findings indicate that octopuses show behavioral flexibility by quickly adapting to a change in a task. This can be compared to tests in other species where subjects had to conduct actions comprised of a set of motor actions that cannot be understood by a simple learning rule alone.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Push-Pull Block Puzzles are Hard

This paper proves that push-pull block puzzles in 3D are PSPACE-complete to solve, and push-pull block puzzles in 2D with thin walls are NP-hard to solve, settling an open question [ZR11]. Pushpull block puzzles are a type of recreational motion planning problem, similar to Sokoban, that involve moving a ‘robot’ on a square grid with 1 × 1 obstacles. The obstacles cannot be traversed by the rob...

متن کامل

ar X iv : c s . C G / 9 91 10 13 v 1 2 8 N ov 1 99 9 PushPush is NP - hard in 3 D

We prove that a particular pushing-blocks puzzle is intractable in 3D. The puzzle, inspired by the game PushPush, consists of unit square blocks on an integer lattice. An agent may push blocks (but never pull them) in attempting to move between given start and goal positions. In the PushPush version, the agent can only push one block at a time, and moreover, each block, when pushed, slides the ...

متن کامل

PushPush is NP-hard in 3D

We prove that a particular pushing-blocks puzzle is intractable in 3D. The puzzle, inspired by the game PushPush, consists of unit square blocks on an integer lattice. An agent may push blocks (but never pull them) in attempting to move between given start and goal positions. In the PushPush version, the agent can only push one block at a time, and moreover, each block, when pushed, slides the ...

متن کامل

PushPush-k is PSPACE-Complete

We prove that a pushing-block puzzle called PUSHPUSH-k is PSPACE-complete for any fixed k ≥ 1. In this puzzle, a robot moves on a finite grid. Each grid position is either empty or occupied by a single obstacle block. While moving, the robot may push obstacle blocks in direction of its movement, subject to certain constraints. In particular, once an obstacle block starts moving, it continues to...

متن کامل

PushPush is NP-hard in 2D

We prove that a particular pushing-blocks puzzle is intractable in 2D, improving an earlier result that established intractability in 3D [OS99]. The puzzle, inspired by the game PushPush, consists of unit square blocks on an integer lattice. An agent may push blocks (but never pull them) in attempting to move between given start and goal positions. In the PushPush version, the agent can only pu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2016